Evaluating Irredundant Maximal Contained Rewritings for XPath Queries on Views
نویسندگان
چکیده
Copyright: Copyright © 2013 The British Computer Society. This is a pre-copyedited, author-produced PDF of an article accepted for publication in The Computer Journal following peer review. The version of record of [Zhou, Rui; Liu, Chengfei; Li, Jianxin; Wang, Junhu and Yu, Jeffrey Xu 2014, 'Evaluating irredundant maximal contained rewritings for XPath queries on views', The Computer Journal, Vol. 57, no. 11 (Nov 2014), pp. 1674-1692] is available online at http://dx.doi.org/10.1093/comjnl/bxt091
منابع مشابه
Finding Irredundant Contained Rewritings of Tree Pattern Queries Using Views
Contained rewriting and maximal contained rewriting of tree pattern queries using views have been studied recently for the class of tree patterns involving /, //, and []. Given query Q and view V , it has been shown that a contained rewriting of Q using V can be obtained by finding a useful embedding of Q in V . However, for the same Q and V , there may be many useful embeddings and thus many c...
متن کاملQuery rewritings using views for XPath queries, framework, and methodologies
Query rewriting using views is a technique that allows a query to be answered efficiently by using pre-computed materialized views. It has many applications, such as data caching, query optimization, schema integration, etc. This issue has been studied extensively for relational databases and, as a result, the technology is maturing. For XML proposed for query rewriting using views for XPath qu...
متن کاملRewriting XPath Queries Using Materialized Views
As a simple XML query language but with enough expressive power, XPath has become very popular. To expedite evaluation of XPath queries, we consider the problem of rewriting XPath queries using materialized XPath views. This problem is very important and arises not only from query optimization in server side but also from semantic caching in client side. We consider the problem of deciding whet...
متن کاملAnswering Queries using Views over Probabilistic XML: Complexity and Tractability
We study the complexity of query answering using views in a probabilistic XML setting, identifying large classes of XPath queries – with child and descendant navigation and predicates – for which there are efficient (PTime) algorithms. We consider this problem under the two possible semantics for XML query results: with persistent node identifiers and in their absence. Accordingly, we consider ...
متن کاملXPath Rewriting Using Views: The More the Merrier
We report in this talk on recent results on richer classes of XPath rewritings using views. The problem of equivalently rewriting queries using views is fundamental to several classical data management tasks. Examples include query optimization using a cache of materialized results of previous queries and database security, where a query is answered only if it has a rewriting using the pre-defi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Comput. J.
دوره 57 شماره
صفحات -
تاریخ انتشار 2014